<TITLE>prob010: social golfer problem</TITLE>
<HR><!------------------------------------------------------------------------>
<CENTER>
<H1>prob010: social golfer problem</H1>

<TABLE>
<TR> <TD> proposed by
     <TD ALIGN=LEFT> <A HREF="http://www.csse.monash.edu.au/~wharvey/">
          <B>Warwick Harvey</B></A>
          <ADDRESS><a href="mailto:wharvey@cs.monash.edu.au">
          wharvey@cs.monash.edu.au</a></ADDRESS>
</TABLE>
</CENTER>
<HR><!------------------------------------------------------------------------>
<H3> Specification </H3>

<TT>

The coordinator of a local golf club has come to you with the following 
problem.  In her club, there are 32 social golfers, each of whom play golf 
once a week, and always in groups of 4.  She would like you to come up with 
a schedule of play for these golfers, to last as many weeks as possible, 
such that no golfer plays in the same group as any other golfer on more than 
one occasion.



<P>

Possible variants of the above problem include:
finding a 10-week schedule with ``maximum socialisation''; that is, as few 
repeated pairs as possible (this has the same solutions as the original 
problem if it is possible to have no repeated pairs), and
finding a schedule of minimum length such that each golfer plays with every 
other golfer at least once (``full socialisation''). 

<P>


</TT>


<HR><!------------------------------------------------------------------------>

<UL>

 <A HREF="../../index.html"> Back</A> to CSPLib home page.


